Interconnections of Markov chains and quasi-reversible queuing networks
نویسندگان
چکیده
منابع مشابه
Electrical Networks and Reversible Markov Chains
The object of this part of the course is to show how the mathematics of finite electrical networks can be used in the study of reversible Markov chains on finite and countable state spaces. The basis of the connection is that harmonic functions for reversible Markov chains can be interpreted as voltages for electrical networks. Thus, techniques for calculating, approximating, and bounding volta...
متن کاملweak-reversible Markov chains
The theory of L-spectral gaps for reversible Markov chains has been studied by many authors. In this paper we consider positive recurrent general state space Markov chains with stationary transition probabilities. Replacing the assumption of reversibility by a less strong one, we still obtain a simple necessary and sufficient condition for the spectral gap property of the associated Markov oper...
متن کاملChapter 3 Reversible Markov Chains
Chapter 2 reviewed some aspects of the elementary theory of general nite irreducible Markov chains. In this chapter we specialize to reversible chains, treating the discrete and continuous-time cases in parallel. After section 3 we shall assume that we are dealing with reversible chains without continually repeating this assumption, and shall instead explicitly say \general" to mean not-necessa...
متن کاملOn Non-reversible Markov Chains
Reversibility is a suucient but not necessary condition for Markov chains for use in Markov chain Monte Carlo simulation. It is necessary to select a Markov chain that has a pre-speciied distribution as its unique stationary distribution. There are many Markov chains that have such property. We give guidelines on how to rank them based on the asymptotic variance of the estimates they produce. T...
متن کاملSymmetry Analysis of Reversible Markov Chains
We show how to use subgroups of the symmetry group of a reversible Markov chain to give useful bounds on eigenvalues and their multiplicity. We supplement classical representation theoretic tools involving a group commuting with a self-adjoint operator with criteria for an eigenvector to descend to an orbit graph. As examples, we show that the Metropolis construction can dominate a max-degree c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 1980
ISSN: 0304-4149
DOI: 10.1016/0304-4149(80)90022-8